Parallel Matrix Multiplication on the Connection Machine
نویسنده
چکیده
منابع مشابه
A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملMatrix Multiplication on Hypercubes Using Full Bandwidth and Constant Storage Matrix Multiplication on Hypercubes Using Full Bandwidth and Constant Storage
For matrix multiplication on hypercube multiproces-sors with the product matrix accumulated in place a processor must receive about P 2 = p N elements of each input operand, with operands of size P P distributed evenly over N processors. With concurrent communication on all ports, the number of element transfers in sequence can be reduced to P 2 = p N logN for each input operand. We present a t...
متن کاملA Divide-and-Conquer Strategy and PVM Computation Environment for the Matrix Multiplication
This paper deals with parallels of the fast matrix multiplication strassen's algorithm, winograd’s algorithm and analyzes empirical study of the matrix multiplication under the distributed environment in which PVM (Parallel Virtual Machine) environment is implemented. The contribution of this paper is that the parallelism of matrix-matrix multiplication need personal computer (or workstation cl...
متن کاملLarge Integer Multiplication on Massively Parallel Processors
We present results of a technique for multiplying large integers using the Fermat Number Transform. When the Fermat Number Transform was first proposed, word length constraints limited its effectiveness. Despite the development of multidimensional techniques to extend the length of the FNT, the relatively small word length of existing machines made the transform of little more than academic int...
متن کاملA three-dimensional approach to parallel matrix multiplication
A three-dimensional (3D) matrix multiplication algorithm for massively parallel processing systems is presented. The P processors are configured as a "virtual" processing cube with dimensions pl, p2, and p3 proportional to the matrices' dimensions-M, N, and K. Each processor performs a single local matrix multiplication of size Mlp, x Nlp, x Wp,. Before the local computation can be carried out,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- International Journal of High Speed Computing
دوره 1 شماره
صفحات -
تاریخ انتشار 1989